An Improved Subset AntNet Algorithm for Numerical Optimization of the Shortest Path Problem
نویسندگان
چکیده
Routing algorithm is the key element in networks performance and reliability, therefore, there is a need for an algorithm to manage traffic flows and deliver packets from the source to the destination in a realistic time. A modification algorithm has been presented called Subset Nodes Based AntNet. In the Subset Nodes Based AntNet, a routing tables maintained at each node is used to get a subset table which helps in reducing number of choices available to each Ant to select the next node and reach the destination. The parameters used to measure the performance of the proposed routing algorithms are: cost, number of iterations and number of Ants. The experiment results show that the proposed Subset Nodes Based AntNet is best in minimizing the cost, number of iterations and number of Ants number in comparison to the original AntNet.
منابع مشابه
Approximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملPerformance analysis of the AntNet algorithm
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of ant-routing algorithms. In this paper, we compare the performance of AntNet, an ant-routing algorithm, with Dijkstra’s shortest path algorithm. Our simulations show that the performance of AntNet is comparable to Dijkst...
متن کاملIdentifying multiple optimal paths in Antnet Routing Algorithm with negligible Overhead
Antnet is an agent based routing algorithm based on real ants' behavior. Ants are able to find shortest path to food source .In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way back they choose the path with the highest pheromones which becomes the shortest path. But Antnet Algorithms may cause the network congestion and stagnation. Here, ...
متن کاملAntnet: Modified Routing Algorithm for Packet Switched Networks
Antnet is an agent based routing algorithm based on real ants' behavior. Ants are able to find shortest path to food source .In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way back they choose the path with the highest pheromones which becomes the shortest path. But Antnet Algorithms may cause the network congestion and stagnation. Here, ...
متن کامل